Constraint 2 is not relaxed
Constraint 3 is relaxed
Constraint 4 is not relaxed
Constraint 5 is relaxed
Constraint 6 is not relaxed
The time to read the input and initialise the problem = 4672 ms

Iteration 1
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 141 ms
The lower bound solution is:
z = -184166.000000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 46142.846154
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -167100.449780
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 45503.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -146701.679010
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 44667.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -132559.475090
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 43298.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -116624.633990
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 43298.846154
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -105710.252320
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 42884.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -96765.508852
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 39914.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 8
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -82826.740389
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 39914.846154
The optimal solution has not been found yet.

Iteration 9
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -70634.724623
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 38845.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 10
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -60626.750941
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 37841.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 11
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -51891.669940
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 36774.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 12
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -44462.285352
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 35625.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 13
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -38304.559881
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 35625.846154
The optimal solution has not been found yet.

Iteration 14
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -32767.029534
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 35625.846154
The optimal solution has not been found yet.

Iteration 15
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -29065.170712
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 36598.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 16
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -24489.966545
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 34445.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 17
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -21356.284919
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 33668.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 18
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -18067.087547
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 33668.846154
The optimal solution has not been found yet.

Iteration 19
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -25693.159405
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 33668.846154
The optimal solution has not been found yet.

Iteration 20
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -22278.788011
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 33668.846154
The optimal solution has not been found yet.

Iteration 21
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -18869.032535
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 33668.846154
The optimal solution has not been found yet.

Iteration 22
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -15454.641289
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 33668.846154
The optimal solution has not been found yet.

Iteration 23
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -12450.017856
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 31329.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -10094.512112
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 32543.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 25
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -7995.685373
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 30043.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 26
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -6174.442889
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 30043.846154
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -4535.731908
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 28773.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 28
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -3163.376113
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 29
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1897.416622
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 30
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -716.789656
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 31
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -108.233057
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 29987.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 32
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 781.899518
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 28773.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 33
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 1845.863681
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -6412.158965
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 29987.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -7352.181135
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 28773.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -6221.261893
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 37
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -5090.340452
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -3959.417334
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 39
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -2828.492324
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 40
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1697.565883
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 41
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -566.637740
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 42
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 522.219294
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 43
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 1590.602620
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 44
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 2709.860944
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 45
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 3800.512669
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28773.846154
The optimal solution has not been found yet.

Iteration 46
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 4464.206485
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 47
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 4988.586588
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 5603.739987
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 4273.239496
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 4913.595291
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 51
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 5553.951797
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 52
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 6194.308964
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 53
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 6816.950490
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 54
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 7420.914172
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 8006.760155
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 56
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 8573.480320
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 9169.181622
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 9676.080690
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 59
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 10288.926163
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 10761.118547
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 61
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 11265.132608
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 11656.040228
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 12046.078075
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 64
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 12424.968361
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 12359.695341
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 29438.376623
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 66
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 12693.260166
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 13070.781822
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 29438.376623
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 13401.381461
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 13798.697673
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 29438.376623
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 14072.053908
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 71
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 12840.993408
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 72
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 13214.431317
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 13502.146926
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 74
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 13014.224687
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 12388.946740
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 11876.484143
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 77
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 11876.627654
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 28706.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 78
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 12212.507924
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 28706.846154
The optimal solution has not been found yet.

Iteration 79
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 11652.352786
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 80
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 12115.945353
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 12579.537990
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 12803.593340
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 13035.389709
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 13267.186208
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 85
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 13492.399299
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 13709.726249
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 87
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 13941.522916
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 88
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 14170.578089
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 14396.025678
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 14608.702177
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 91
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 14830.839554
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 92
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 15036.957441
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 93
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 14738.650643
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 14953.079567
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 15167.508825
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 96
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 15375.383305
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 15574.975463
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 15301.878664
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26360.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 15429.681766
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 100
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 15566.576725
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 26360.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 101
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 15696.007893
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 15823.986763
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 103
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 15950.429761
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = 16075.355535
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 105
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 16198.782297
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 16319.231019
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 47 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 107
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 16446.661242
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26360.970588
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 108
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 16565.632392
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 109
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 16682.940007
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 110
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 16816.323252
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26360.970588
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 111
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 16925.757387
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17059.193781
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17171.489952
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 114
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17305.837103
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 17417.285358
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 116
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17523.904875
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17615.580168
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 118
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17729.503900
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 119
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 16937.695101
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 78 ms
The optimal solution has not been found yet.

Iteration 120
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 16850.163002
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 121
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 17005.527248
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 17116.715768
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 123
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17253.706989
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 124
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 17358.512518
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17036.976085
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17125.753461
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17004.338251
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 17159.702760
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17308.241642
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 130
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17448.920600
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17383.739573
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17539.103987
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 17694.468435
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17849.832680
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 135
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18003.031331
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 136
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18153.472511
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18301.205610
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18446.279612
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 139
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18578.636224
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18582.514676
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18721.342619
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18838.299717
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 143
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18318.149094
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18276.542252
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18410.248021
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18545.496116
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18597.251846
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 148
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18389.715893
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 149
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18504.707819
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18637.035204
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 151
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18495.035584
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 152
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18448.094021
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18583.500690
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18718.907145
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18854.313858
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18989.432111
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 157
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19122.118544
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19252.416456
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19380.369072
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 160
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19506.018614
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19613.053532
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 162
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19639.672434
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 163
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19690.081599
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19727.486184
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19756.253662
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19801.798858
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19743.402713
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19792.596004
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 169
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19830.465718
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 170
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19878.098822
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 171
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19886.645936
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 27492.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19944.914406
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 27492.846154
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19988.877691
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20000.873325
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20048.573404
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20095.915988
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20138.563998
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 178
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20153.435008
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20199.991166
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 180
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20244.469220
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20288.104177
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 182
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 20245.063362
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20279.118159
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20300.949555
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20346.399183
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20387.467171
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 187
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20410.776615
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 188
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20455.402806
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20491.906181
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 190
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20518.637461
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20562.454499
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20594.474921
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20624.566846
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 194
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20656.006661
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20698.738221
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 196
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20704.429571
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26360.970588
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 197
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20738.369044
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20769.963081
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 199
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20803.114695
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 200
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20797.004443
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26949.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20832.263339
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 202
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20865.435218
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26949.909091
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20897.815597
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26702.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 20930.593943
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26702.882353
The optimal solution has not been found yet.

Iteration 205
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20920.240137
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26360.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20952.822664
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20985.077375
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21017.332762
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 209
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21047.948929
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 26360.970588
The optimal solution has not been found yet.

Iteration 210
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21074.823534
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 211
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21088.953147
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 25326.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 212
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21098.370192
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 25326.882353
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21094.825131
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 214
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21112.315696
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 215
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21129.743269
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 216
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21147.092405
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 217
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21163.230824
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 25326.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 218
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21171.307695
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 25326.882353
The optimal solution has not been found yet.

Iteration 219
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21166.710900
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 220
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21183.872968
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 221
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21199.735045
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 222
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21216.769177
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 223
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21233.726628
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21249.174005
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 25326.882353
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21221.457622
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21237.793788
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21254.605398
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21271.392772
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21288.104383
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 230
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21304.740770
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21320.708412
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 232
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21322.396072
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 233
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21338.074410
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 234
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21233.954326
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 235
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21246.295328
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 25326.882353
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 236
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21212.332462
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 237
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21228.743952
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21245.155424
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21261.566887
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21277.978351
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 241
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21294.389792
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21302.595643
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 243
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = 21310.113299
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 244
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21318.319137
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 245
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21326.524736
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 246
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21334.730565
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 247
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21342.936152
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 248
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21351.131044
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 249
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21359.307263
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21367.465067
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 251
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21375.604762
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 252
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21383.725893
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 253
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21389.920939
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 25326.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21378.643610
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 255
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21386.732751
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 256
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 21394.821679
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 257
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21402.899799
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21410.630876
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 259
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21413.926651
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 260
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21421.961554
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 261
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21429.978605
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21435.884987
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 263
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21435.271300
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21443.192585
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 265
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21443.476654
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 266
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21451.445287
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21459.395755
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 268
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21464.800939
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 269
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21469.889331
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 270
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21475.469485
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21475.658593
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 272
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 21483.554586
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 273
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21491.433031
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 274
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21499.293519
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 275
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21507.136553
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 276
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21514.961705
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 277
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21522.542165
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 278
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21523.057781
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21530.847109
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21538.619144
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 281
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21541.874451
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 282
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21549.273954
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 283
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21529.765032
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 284
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 21537.495380
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21545.032351
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21548.789882
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 287
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21556.520445
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 288
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21564.234486
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 289
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21568.489830
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 21574.948924
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 291
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21577.524967
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 292
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21584.646824
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 293
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21565.175021
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 294
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21572.825771
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 295
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21580.476733
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21585.769584
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21593.417802
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24984.970588
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21599.826473
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 62984.928571
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 21603.155146
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24984.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21592.560804
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 62984.928571
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 412312 ms
The total time to calculate the lower bounds with CPLEX = 3840 ms
The total time to calculate the upper bounds with CPLEX = 1182 ms
The total time to create the lower bound problems = 7169 ms
The total time to read the lower bound solutions = 1677 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 1910 ms
The total time to read the upper bound solutions = 657 ms 

The best upper bound found = 24984.970588, the best lower bound found = 21603.155146
Therefore the duality gap is 15.654266%
